Solving the income fluctuation problem with unbounded rewards

نویسندگان

  • Huiyu Li
  • John Stachurski
چکیده

This paper studies the income fluctuation problem without imposing bounds on utility, assets, income or consumption. We prove that the Coleman operator is a contraction mapping over the natural class of candidate consumption policies when endowed with a metric that evaluates consumption differences in terms of marginal utility. We show that this metric is complete, and that the fixed point of the operator coincides with the unique optimal policy. As a consequence, even in this unbounded setting, policy function iteration always converges to the optimal policy at a geometric rate. & 2014 Elsevier B.V. All rights reserved.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

SOLVING SINGULAR ODES IN UNBOUNDED DOMAINS WITH SINC-COLLOCATION METHOD

Spectral approximations for ODEs in unbounded domains have only received limited attention. In many applicable problems, singular initial value problems arise. In solving these problems, most of numerical methods have difficulties and often could not pass the singular point successfully. In this paper, we apply the sinc-collocation method for solving singular initial value problems. The ability...

متن کامل

A NOTE ON THE ZIMMERMANN METHOD FOR SOLVING FUZZY LINEAR PROGRAMMING PROBLEMS

There are several methods for solving fuzzy linear programming (FLP)problems. When the constraints and/or the objective function are fuzzy, the methodsproposed by Zimmermann, Verdegay, Chanas and Werners are used more often thanthe others. In the Zimmerman method (ZM) the main objective function cx is addedto the constraints as a fuzzy goal and the corresponding linear programming (LP)problem w...

متن کامل

Solving high-order partial differential equations in unbounded domains by means of double exponential second kind Chebyshev approximation

In this paper, a collocation method for solving high-order linear partial differential equations (PDEs) with variable coefficients under more general form of conditions is presented. This method is based on the approximation of the truncated double exponential second kind Chebyshev (ESC) series. The definition of the partial derivative is presented and derived as new operational matrices of der...

متن کامل

Running Head: CONNECTIONIST MODEL OF PROBLEM SOLVING

We present a cognitive, connectionist-based model of complex problem solving that integrates cognitive biases and distance-based and environmental rewards under a temporal-difference learning mechanism. The model is tested against experimental data obtained in a well-defined and planning-intensive problem. We show that incorporating cognitive biases (symmetry and simplicity) in a temporal-diffe...

متن کامل

Emergent Algorithms Ñ A New Method for Enhancing Survivability in Unbounded Systems

Traditional security approaches are not sufficient to deal with the protection and survivability of highly distributed information systems operating in unbounded networks. This paper discusses the need for and importance of survivability, defines unbounded network, and examines the characteristics that differentiate survivability from other software quality attributes and nonfunctional properti...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2015